ACM. - 물문제. Codeforces Round #436 (Div. 2) Make a Permutation! #include #define pb push_back #define mp make_pair using namespace std; int a[200005]; int vis[200005];//记录访问过几次 bool vis1[200005];//记录是不是访问过 int main() { int n; scanf("%d",&n); memset(vis,0,sizeof(vis)); memset(vis1,0,s... ACM. - 물문제.Codeforces
Codeforces Round #436 (Div. 2) Make a Permutation! #include #define pb push_back #define mp make_pair using namespace std; int a[200005]; int vis[200005];//记录访问过几次 bool vis1[200005];//记录是不是访问过 int main() { int n; scanf("%d",&n); memset(vis,0,sizeof(vis)); memset(vis1,0,s... ACM. - 물문제.Codeforces